A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints
نویسندگان
چکیده
منابع مشابه
Augmenting undirected node-connectivity by one
We present a min-max formula for the problem of augmenting the nodeconnectivity of a graph by one and give a polynomial time algorithm for finding an optimal solution. We also solve the minimum cost version for node-induced cost functions.
متن کاملA Fast Algorithm for Optimally Increasing the Edge-Connectivity
Let G = (V, E ) be an undirected, unweighted graph with n nodes, m edges and connectivity A. Given an input parameter 6, the Edge Augmentation Problem is to find the smallest set of edges to add to G so that its edge-connectivity is increased by 6. In this paper we give a solution to this problem which runs in 0(J2nm + nF(n)) , where F ( n ) is the time to perform one maximum flow on G. In fact...
متن کاملA simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph
The Tree Augmentation Problem(TAP) is given a connected graph G = (V, E) and an edge set E on V disjoint to E , find a minimum size subset of edges F ⊆ E such that (V, E ∪ F ) is 2-edge-connected. In [5] and [6] a 1.8 and 1.5 approximation were given for the problem. The proof of the 1.5 was cut into two papers, as our proof then was very complex and very long. In the current paper we present a...
متن کاملA 1.5-approximation algorithm for augmenting edge-connectivity of a graph
We present a 1.5-approximation algorithm for the following NP-hard problem: given a connected graph G = (V, E) and an edge set E on V disjoint to E , find a minimum size subset of edges F ⊆ E such that (V, E ∪ F ) is 2-edge-connected. Our result improves and significantly simplifies the approximation algorithm with ratio 1.875 + ε of Nagamochi.
متن کاملA 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
We consider the following NP-hard problem: given a connected graph G = (V, E) and an edge set E on V disjoint to E , find a minimum size subset of edges F ⊆ E such that (V, E ∪ F ) is 2-edge-connected. In [4] we presented a 1.8 approximation for the problem. In this paper we improve the ratio to 1.5. ∗Preliminary version appeared in APPROX 2001, LNCS 2129, pp. 90-101, 2001. †Dept. of Electrical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.769